Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs
نویسندگان
چکیده
منابع مشابه
Run-time Detection of Communication Deadlocks in Occam 2 Programs
A novel approach to detection of communication deadlocks in occam 2 programs is proposed. The main feature of the approach is to monitor the interprocess communications of a target occam 2 program at runtime and detect communication deadlocks in the program by operating a Process-Wait-For Graph (PWFG) of the program. The PWFG is a formal representation of the synchronization waiting situation i...
متن کاملAnalysis of Mpi Programs
We investigate the application of formal verification techniques to parallel programs which employ the Message Passing Interface (MPI). We develop a formal model of a subset of MPI, and then prove a number of theorems about that model which ameliorate or eliminate altogether the state explosion problem. As an example, we show that if one wishes to verify freedom from deadlock, it suffices to co...
متن کاملDepth Analysis of MPI Programs
Data-flow analyses that include some model of the data-flow between MPI sends and receives result in improved precision in the analysis results. One issue that arises with performing data-flow analyses on MPI programs is that the interprocedural control-flow graph ICFG is often irreducible due to call and return edges, and the MPI-ICFG adds further irreducibility due to communication edges. To ...
متن کاملDeadlock Detection in Basic Models of MPI Synchronization Communication Programs
Deadlock Detection in Basic Models of MPI Synchronization Communication Programs LIAO Ming-xue, FAN Zhi-hua (Institute of Software, the Chinese Academy of Sciences, Beijing 100080, China) Abstract: A model of MPI synchronization communication programs is presented and its three basic simplified models are also defined. A series of theorems and methods for deciding whether deadlocks will occur a...
متن کاملVisualizing Potential Deadlocks in Multithreaded Programs
It is important to analyze and identify potential deadlocks resident in multithreaded programs from a successful deadlock-free execution, because the nondeterministic nature of such programs may hide the errors during testing. Visualizing the runtime behaviors of locking operations makes it possible to debug such errors effectively, because it provides intuitive understanding of different feasi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 2017
ISSN: 0164-0925,1558-4593
DOI: 10.1145/3095075